Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MEM2(x, union2(y, z)) -> MEM2(x, z)
MEM2(x, union2(y, z)) -> OR2(mem2(x, y), mem2(x, z))
MEM2(x, union2(y, z)) -> MEM2(x, y)

The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

MEM2(x, union2(y, z)) -> MEM2(x, z)
MEM2(x, union2(y, z)) -> OR2(mem2(x, y), mem2(x, z))
MEM2(x, union2(y, z)) -> MEM2(x, y)

The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MEM2(x, union2(y, z)) -> MEM2(x, z)
MEM2(x, union2(y, z)) -> MEM2(x, y)

The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


MEM2(x, union2(y, z)) -> MEM2(x, z)
MEM2(x, union2(y, z)) -> MEM2(x, y)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
MEM2(x1, x2)  =  MEM1(x2)
union2(x1, x2)  =  union2(x1, x2)

Lexicographic Path Order [19].
Precedence:
union2 > MEM1


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

or2(true, y) -> true
or2(x, true) -> true
or2(false, false) -> false
mem2(x, nil) -> false
mem2(x, set1(y)) -> =2(x, y)
mem2(x, union2(y, z)) -> or2(mem2(x, y), mem2(x, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.